package ZuoYe6_DuoChongXunHuan_0424;

public class ZuoYe6_SanWeiShuZuHe {

	public static void main(String[] args) {
		// 6：1、2、4、9个数字，能组成多少个互不相同且无重复数字的三位数？都是多少？
		int[] s = { 1, 2, 3, 9 };
		int num = 0;
		for (int i = 0; i < s.length; i++) {
			for (int j = 0; j < s.length; j++) {
				for (int k = 0; k < s.length; k++) {
					if (s[i] == s[j] || s[j] == s[k] || s[i] == s[k])
						continue;
					num++;
					System.out.println("第" + num + "个:" + s[i] + s[j] + s[k]);
				}
			}
		}
	}

}
